A Universal Self - Stabilizing Mutual Exclusion Algorithm ∗ 3 Q @ nM 5 < ! 9 - EgBg 3

A distributed system consists of a set of processes and a set of communication links. A distributed system is said to be self-stabilizing if it converges to a correct system state from arbitrary initial system states. A self-stabilizing system is considered to be a fault tolerant system , since it tolerates any kind and any finite number of transient failures. The leader election and mutual exclusion problems are fundamental problems in distributed systems, and they have been investigated extensibly. Study on self-stabilizing leader election and mutual exclusion problems have been focused on the space complexity of processes and convergence time. In this paper, we investigate a class of networks on which the leader election and mutual exclusion problems can be solved. We show graph theoretical characterization of networks on which these problems assuming central and distributed daemons for execution scheduling model and registers for communication model.